#include <iostream>
#include "stack.h"
#include <vector>
#include <deque>
#include <list>

using namespace std;


int main()
{
	//bit::stack<int> st1;
	//bit::stack<int,vector<int>> st1;
	bit::stack<int,list<int>> st1;

	st1.push(1);
	st1.push(2);
	st1.push(3);
	st1.push(4);
	st1.push(5);

	while(!st1.empty())
	{
		cout << st1.top() << " ";
		st1.pop();
	}
	cout << endl;

	bit::queue<int> qe;
	qe.push(1);
	qe.push(2);
	qe.push(3);
	qe.push(4);
	qe.push(5);

	while (!qe.empty())
	{
		cout << qe.front() << " ";
		qe.pop();
	}
	cout << endl;
	return 0;
}